Revisiting Move Groups in Monte-Carlo Tree Search
نویسندگان
چکیده
The UCT (Upper Confidence Bounds applied to Trees) algorithm has allowed for significant improvements in a number of games, most notably the game of Go. Move groups is a modification that greatly reduces the branching factor at the cost of increased search depth and as such may be used to enhance the performance of UCT. From the results of the experiments, we conclude the general structure of good move groups and the parameters to use for enhancing the playing strength.
منابع مشابه
Monte-Carlo Tree Reductions for Stochastic Games
Monte-Carlo Tree Search (MCTS) is a powerful paradigm for perfect information games. When considering stochastic games, the tree model that represents the game has to take chance and a huge branching factor into account. As effectiveness of MCTS may decrease in such a setting, tree reductions may be useful. Chance-nodes are a way to deal with random events. Move-groups are another way to deal e...
متن کاملRevisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo
We revisit Monte-Carlo Tree Search on a recent game, termed NoGo. Our goal is to check if known results in Computer-Go and various other games are general enough for being applied directly on a new game. We also test if the known limitations of Monte-Carlo Tree Search also hold in this case and which improvements of Monte-Carlo Tree Search are necessary for good performance and which have a min...
متن کاملMonte-Carlo Tree Search: Applied to Domineering and Tantrix
................................................................................................................................................... i Chapter 1: Introduction ........................................................................................................................... 1 The Rules of Tantrix ...............................................................................
متن کاملA Parallel Monte-Carlo Tree Search Algorithm
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a network of computers using various configurations: from 12,500 to 100,000 playouts, from 1 to 64 slaves, and from 1 to 16 computers. On our architecture we obtain a speedup of 14 for 16 slaves. With a single slave and fiv...
متن کاملMonte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel
Monte Carlo Tree Search (MCTS) has become a widely popular sampled-based search algorithm for two-player games with perfect information. When actions are chosen simultaneously, players may need to mix between their strategies. In this paper, we discuss the adaptation of MCTS to simultaneous move games. We introduce a new algorithm, Online Outcome Sampling (OOS), that approaches a Nash equilibri...
متن کامل